Approximating minimum independent dominating sets in wireless networks
نویسندگان
چکیده
منابع مشابه
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded growth are used to characterize wireless communication networks, and this class of graph includes many models known from the literature, e.g. (Quasi) Unit Disk Graphs. An independent dominating set is a dominating set in ...
متن کاملMinimum Matching Dominating Sets and Its Applications in Wireless Networks
For wireless ad hoc network no fixed infrastructure or centralized management, a Minimum Matching Dominating Set (MMDS) has been proposed as the virtual backbone. The MMDS of a graph representing a network has a significant impact on an efficient design of routing protocols in wireless networks. This problem has been studied extensively in Unit Disk Graphs (UDG), in
متن کاملApproximating the Minimum Independent Dominating Set in Perturbed Graphs
We investigate the minimum independent dominating set in perturbed graphs g(G, p) of input graph G = (V,E), obtained by negating the existence of edges independently with a probability p > 0. The minimum independent dominating set (MIDS) problem does not admit a polynomial running time approximation algorithm with worst-case performance ratio of n1− for any > 0. We prove that the size of the mi...
متن کاملMinimum independent dominating sets of random cubic graphs
We present a heuristic for finding a small independent dominating set, D, of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain an upper bound on the expected size of D. A corresponding lower bound is derived by means of a direct expectation argument. We prove that D asymptotically almost...
متن کاملTrees with two disjoint minimum independent dominating sets
The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. In this paper we provide a constructive characterization of trees G that have two disjoint i(G)-sets. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.09.021